Intelligibility of Complex Networks. Urbanization Road to a Harmonious City

We suggest a principle of intelligibility for complex networks accordingly to which any global characteristic relevant a node in a complex network (e.g. it's centrality, it's accessibility from other nodes, etc.) scales with its local property (degree). We also relate the properties of random walks defined on the dual graph representation of a transport network to the unique equilibrium configuration of not random commodity flows along edges of its primary graph representation that unveils the role Markov's chain processes and space syntax approach play in the successful traffic modelling.